transaction graph - определение. Что такое transaction graph
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое transaction graph - определение

IN TEMPORAL DATABASES, THE POINT IN TIME AT WHICH A DATABASE FACT WAS STORED IN THE DATABASE
Transaction Time; Transaction-time
Найдено результатов: 805
Transaction cost         
COST INCURRED IN MAKING AN ECONOMIC EXCHANGE
Transaction costs; Transactions costs; Transaction cost economics; Transaction Cost Economics; Entry cost; Transactions cost; Transaction-cost economics; Transaction (economics); Transactional cost; Transactional costs
In economics and related disciplines, a transaction cost is a cost in making any economic trade when participating in a market.Buy-side Use TCA to Measure Execution Performance, FIXGlobal, June 2010 Oliver E.
Financial transaction         
  • Purchases can be made through the use of physical currency, such as cash.
  • Silver coin of the [[Maurya Empire]], from the 3rd century BC
AGREEMENT, OR COMMUNICATION, CARRIED OUT BETWEEN A BUYER AND A SELLER TO EXCHANGE AN ASSET FOR PAYMENT
Payment transactions; Bank transactions; Payment transfer; Financial transactions; Commercial Transaction; Commercial transaction; Cash transactions
A financial transaction is an agreement, or communication, between a buyer and seller to exchange goods, services, or assets for payment. Any transaction involves a change in the status of the finances of two or more businesses or individuals.
Transaction data         
DATA DESCRIBING A TRANSACTION
Transaction information
Transaction data is data describing an event (the change as a result of a transaction) and is usually described with verbs. Transaction data always has a time dimension, a numerical value and refers to one or more objects (i.
Null graph         
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
Turán graph         
  • The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.
GRAPH
Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph
The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is
Database transaction         
UNIT OF WORK PERFORMED WITHIN A DATABASE MANAGEMENT SYSTEM
Begin work (SQL); BEGIN WORK(SQL); LUW; Start transaction (SQL); Database transactions; Transaction (database); Unit of work design pattern; Unit of work pattern
A database transaction symbolizes a unit of work, performed within a database management system (or similar system) against a database, that is treated in a coherent and reliable way independent of other transactions. A transaction generally represents any change in a database.
Dense graph         
GRAPH IN WHICH THE NUMBER OF EDGES IS CLOSE TO THE MAXIMUM FOR ITS NUMBER OF VERTICES
Sparse graph; Graph density; Density (graph theory)
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph.
Butterfly graph         
PLANAR GRAPH WITH 5 NODES AND 6 EDGES
Bowtie graph; Hourglass graph; Bowtie-free graphs; Bowtie-free graph
In the mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar undirected graph with 5 vertices and 6 edges.ISGCI: Information System on Graph Classes and their Inclusions.
Graph (abstract data type)         
ABSTRACT DATA TYPE IN COMPUTER SCIENCE
Weighted, directed graph; Graph (computer science); Graph data structure; Graph (data structure); Graph (data structure; Graph representation
In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics.
Graph of a function         
  • Plot of the graph of <math>f(x, y) = - \left(\cos\left(x^2\right) + \cos\left(y^2\right)\right)^2,</math> also showing its gradient projected on the bottom plane.
  • function]] <math>f(x, y) = \sin\left(x^2\right) \cdot \cos\left(y^2\right).</math>
  • interval]] [−2,+3]. Also shown are the two real roots and the local minimum that are in the interval.
REPRESENTATION OF A FUNCTION AS THE SET OF PAIRS (X, F(X))
Graph (function); Graph (functions); Graph of a relation; Function graph; Graphs of functions; Graph of a function of two variables; Graph sketching; Function graphing; Graph of a mapping; Surface plot (mathematics); Graph of a multifunction
In mathematics, the graph of a function f is the set of ordered pairs (x, y), where f(x) = y. In the common case where x and f(x) are real numbers, these pairs are Cartesian coordinates of points in two-dimensional space and thus form a subset of this plane.

Википедия

Transaction time

In temporal databases, transaction time (TT) is the time during which a fact stored in the database is considered to be true. As of December 2011, ISO/IEC 9075, Database Language SQL:2011 Part 2: SQL/Foundation included clauses in table definitions to define "system-versioned tables" (that is, transaction-time tables).

In a database table transaction interval is often represented as an interval allowing the system to "remove" entries by using two table-columns StartTT and EndTT. The time interval is closed at its lower bound and open at its upper bound.

When the ending transaction time is unknown, it may be considered as "Until Changed". Academic researchers and some RDBMS have represented "Until Changed" with the largest timestamp supported or the keyword "forever". This convention is not technically precise.

The term was coined by Richard T. Snodgrass and his doctoral student Ilsoo Ahn.